ABSTRACT

The Distributed Diffusion Kalman Filter (DDKF) algorithm has earned great attention lately and shows an elaborate way to address the issue of distributed optimization over networks. Estimation and tracking of a single state vector collectively by nodes have been the point of focus. However, there are several multi-task-oriented issues where the optimal state vector for each node may not be the same. This work considers sensor networks for distributed multi-task tracking in which individual nodes communicate with their immediate nodes. A diffusionbased distributed multi-task tracking algorithm is developed. This is done by implementing an unsupervised adaptive clustering process, which aids nodes in forming clusters and collaborating on tasks. This gave rise to an effective level of cooperation for improving state vector estimation accuracy, especially in cases where a cluster's background experience is unknown. To demonstrate the efficiency of our algorithm, computer simulations were conducted. Comparison has been carried out for the Diffusion Kalman Filtermulti-task with respect to the Adapt-Then-Combine (ATC) diffusion schemes utilizing both static and adaptive combination weights. Results showed that the ATC diffusion schemes algorithm has great performance with the adaptive combiners as compared to static combiners.

Keywords: - Adaptive clustering, Diffusion scheme, Distributed Kalman filtering, Multi-task sensor networks